On the Finite Presentation of Subdirect Products and the Nature of Residually Free Groups

We establish virtual surjection to pairs (VSP) as a general criterion for the finite presentability of subdirect products of groups: if Γ1, . . . ,Γn are finitely presented and S < Γ1×· · ·×Γn projects to a subgroup of finite index in each Γi × Γj , then S is finitely presentable, indeed there is an algorithm that will construct a finite presentation for S. We use the VSP criterion to characterise the finitely presented residually free groups. We prove that the class of such groups is recursively enumerable. We describe an algorithm that, given a finite presentation of a residually free group, constructs a canonical embedding into a direct product of finitely many limit groups. We solve the (multiple) conjugacy problem and membership problem for finitely presentable subgroups of residually free groups. We also prove that there is an algorithm that, given a finite generating set for such a subgroup, will construct a finite presentation. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups that are neither FP∞ nor of Stallings-Bieri type.